From Rewrite Theories to Temporal Logic Theories
نویسندگان
چکیده
منابع مشابه
Rewrite Theories to Temporal
The work presented here aims at bridging the gap between executable speciications and formal veriication. In this paper we combine two levels of description without changing the framework. The operational level of Maude/rewriting logic and the property-oriented level of temporal logics are combined. The combination is done by an embedding. We propose a distributed temporal logic as an extension...
متن کاملProbabilistic Rewrite Theories
We propose probabilistic rewrite theories as a general semantic framework supporting highlevel specification of probabilistic systems that can be massively concurrent. We give the definition and semantics of probabilistic rewrite theories and discuss the mappings between different classes of theories and models. We then define the semantics of probabilistic temporal formulae for a given probabi...
متن کاملGeneralized Rewrite Theories
Since its introduction, more than a decade ago, rewriting logic has attracted the interest of both theorists and practitioners, who have contributed in showing its generality as a semantic and logical framework and also as a programming paradigm. The experimentation conducted in these years has suggested that some significant extensions to the original definition of the logic would be very usef...
متن کاملA Constructor-Based Reachability Logic for Rewrite Theories
Reachability logic has been applied to K rewrite-rule-based language definitions as a language-generic logic of programs. To be able to verify not just code but also distributed system designs, a new rewritetheory-generic reachability logic is presented and proved sound for a wide class of rewrite theories. The logic’s automation is increased by means of constructor-based semantic unification, ...
متن کاملSemantic Matching in Rewrite Theories
\Semantic matching" is the process of generating a basis set of substitutions (of terms for variables) that makes one term equal to another in a speci ed theory. We restrict ourselves here to matching problems in equational theories that can be presented as programs in the form of convergent rewrite systems, that is, nite sets of equations that compute unique output values when applied (from le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1998
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)82555-1